Deadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
نویسندگان
چکیده
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2D-mesh and hyper-cube topologies. The dual-path routing algorithm requires less system resource, while the multi-path routing algorithm creates less traac. More importantly, both routing algorithms are deadlock-free, which is essential to wormhole networks.
منابع مشابه
Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a re...
متن کاملTree-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks with Hamiltonian Path
Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...
متن کاملA New Theory of Deadlock-free Adaptive Multicast Routing in Wormhole Networks
A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in 11, 14]. This theory supplies the suu-cient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. Multicast communication refers to the delivery of the same message...
متن کاملA Performance Enhanced and Cost Effective Deadlock Recovery Scheme for Adaptive Wormhole Routed Networks
Deadlock free routing of messages is a challenge for the performance of directly connected network systems. Communication among the nodes of a directly connected multicomputer system is via message exchange. The wormhole routing is perceived as the best switching technique in directly connected systems. The technique suffers the challenges like deadlock avoidance. Deadlock recovery faces cost o...
متن کاملMulticast Communication on Wormhole-Routed Star Graph Interconnection Networks with Tree-Based Approach
Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we address an efficient and deadlock-free tree-based multicast routing...
متن کامل